Milnor numbers, spanning trees, and the Alexander–Conway polynomial
نویسندگان
چکیده
منابع مشابه
On Spanning Trees with Low Crossing Numbers
Every set S of n points in the plane has a spanning tree such that no line disjoint from S has more than O( √ n) intersections with the tree (where the edges are embedded as straight line segments). We review the proof of this result (originally proved by Bernard Chazelle and the author in a more general setting), point at some methods for constructing such a tree, and describe some algorithmic...
متن کاملPolynomial Representation for the Expected Length of Minimal Spanning Trees∗
In this paper, we investigate the polynomial integrand of an integral formula that yields the expected length of the minimal spanning tree of a graph whose edges are uniformly distributed over the interval [0, 1]. In particular, we derive a general formula for the coefficients of the polynomial and use it to express the first few coefficients in terms of the structure of the underlying graph; e...
متن کاملSquare Numbers, Spanning Trees and Invariants of Achiral Knots
We examine and partially confirm some questions on properties of the the Alexander and HOMFLY polynomial of achiral knots. In particular we show that determinants of achiral knots are exactly the odd numbers representable as sums of two squares. Using the checkerboard coloring, then an analogous statement follows for the number of spanning trees in planar self-dual graphs.
متن کاملMilnor Numbers of Projective Hypersurfaces and the Chromatic Polynomial of Graphs
The chromatic polynomialχG(q) of a graph G counts the num-ber of proper colorings of G. We give an affirmative answer to the conjectureof Read and Rota-Heron-Welsh that the absolute values of the coefficients ofthe chromatic polynomial form a log-concave sequence. The proof is obtainedby identifyingχG(q) with a sequence of numerical invariants of a projectivehypersur...
متن کاملCounting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 2003
ISSN: 0001-8708
DOI: 10.1016/s0001-8708(03)00019-7